Cube-magic labelings of grids

Title: Cube-magic labelings of grids
Creator: Kalinowski, T.; Ryan, J.; Nirmalasari Wijaya, R. W.
Relation: ARS Combinatoria Vol. 151, p. 247-256
Relation: http://combinatorialmath.com/index.php/ArsCombinatoria/article/view/3079
Publisher: Charles Babbage Research Centre
Resource Type: journal article
Date: 2020
Description: We show that the vertices and edges of a d-dimensional grid graph G — (V, E) (d > 2) can be labeled with the integers from {1,...,|V|} and {1 respectively, in such a way that for every subgraph H isomorphic to a d-cube the sum of all the labels of H is the same. As a consequence, for every d ≥ 2, every d-dimensional grid graph is Q-supermagic where Q is the d-cube.
Subject: Caresian product of paths; graph labeling; grid path; H-magic labeling
Identifier: http://hdl.handle.net/1959.13/1481219
Identifier: uon:50676
Identifier: ISSN:0381-7032
Language: eng

		Thumbnail	File	Description	Size	Format